On the Properties of the Exchange Graph of a Cluster Algebra

نویسندگان

  • MIKHAIL GEKHTMAN
  • ALEK VAINSHTEIN
چکیده

We prove a conjecture about the vertices and edges of the exchange graph of a cluster algebra A in two cases: when A is of geometric type and when A is arbitrary and its exchange matrix is nondegenerate. In the second case we also prove that the exchange graph does not depend on the coefficients of A. Both conjectures were formulated recently by Fomin and Zelevinsky. 1. Main definitions and results To state our results, recall the definition of a cluster algebra; for details see [FZ1, FZ4]. Let P be a semifield, that is, a free multiplicative abelian group of a finite rank m with generators g1, . . . , gm endowed with an additional operation ⊕, which is commutative, associative and distributive with respect to the multiplication. As an ambient field we take the field F of rational functions in n independent variables with coefficients in the field of fractions of the integer group ring ZP . A square matrix B is called skew-symmetrizable if DB is skew-symmetric for a non-degenerate non-negative diagonal matrix D. A seed is a triple Σ = (x,y, B), where x = (x1, . . . , xn) is a transcendence basis of F over the field of fractions of ZP , y = (y1, . . . , yn) is an n-tuple of elements of P and B is a skew-symmetrizable integer n × n matrix. The components of the seed are called the cluster , the coefficient tuple and the exchange matrix , respectively; the entries of x are called cluster variables. A seed mutation in direction k ∈ [1, n] takes Σ to an adjacent seed Σ = (x,y, B) whose components are defined as follows. The adjacent cluster x is given by x = (x \ {xk})∪{x ′ k}, where the new cluster variable x ′ k is defined by the exchange relation (1) xkx ′ k = yj yj ⊕ 1 ∏ bki>0 xki i + 1 yj ⊕ 1 ∏

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Properties of extended ideal based zero divisor graph of a commutative ring

This paper deals with some results concerning the notion of extended ideal based zero divisor graph $overline Gamma_I(R)$ for an ideal $I$ of a commutative ring $R$ and characterize its bipartite graph. Also, we study the properties of an annihilator of $overline Gamma_I(R)$.

متن کامل

Exact annihilating-ideal graph of commutative rings

The rings considered in this article are commutative rings with identity $1neq 0$. The aim of this article is to define and study the exact annihilating-ideal graph of commutative rings. We discuss the interplay between the ring-theoretic properties of a ring and graph-theoretic properties of exact annihilating-ideal graph of the ring.

متن کامل

A graph associated to spectrum of a commutative ring

Let $R$ be a commutative ring. In this paper, by using algebraic properties of $R$, we study the Hase digraph of prime ideals of $R$.

متن کامل

CLUSTER ALGEBRAS AND CLUSTER CATEGORIES

These are notes from introductory survey lectures given at the Institute for Studies in Theoretical Physics and Mathematics (IPM), Teheran, in 2008 and 2010. We present the definition and the fundamental properties of Fomin-Zelevinsky’s cluster algebras. Then, we introduce quiver representations and show how they can be used to construct cluster variables, which are the canonical generator...

متن کامل

Line graphs associated to the maximal graph

Let $R$ be a commutative ring with identity. Let $G(R)$ denote the maximal graph associated to $R$, i.e., $G(R)$ is a graph with vertices as the elements of $R$, where two distinct vertices $a$ and $b$ are adjacent if and only if there is a maximal ideal of $R$ containing both. Let $Gamma(R)$ denote the restriction of $G(R)$ to non-unit elements of $R$. In this paper we study the various graphi...

متن کامل

1 2 Fe b 20 06 CLUSTER ALGEBRAS IV : COEFFICIENTS

We study the dependence of a cluster algebra on the choice of coefficients. We write general formulas expressing the cluster variables in any cluster algebra in terms of the initial data; these formulas involve a family of polynomials associated with a particular choice of “principal” coefficients. We show that the exchange graph of a cluster algebra with principal coefficients covers the excha...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008